On polynomial interpolation with mixed conditions

On partial polynomial interpolation

The Alexander-Hirschowitz theorem says that a general collection of k double points in P imposes independent conditions on homogeneous polynomials of degree d with a well known list of exceptions. We generalize this theorem to arbitrary zero-dimensional schemes contained in a general union of double points. We work in the polynomial interpolation setting. In this framework our main result says ...

On multivariate polynomial interpolation

We provide a map Θ 7→ ΠΘ which associates each finite set Θ of points in C with a polynomial space ΠΘ from which interpolation to arbitrary data given at the points in Θ is possible and uniquely so. Among all polynomial spaces Q from which interpolation at Θ is uniquely possible, our ΠΘ is of smallest degree. It is also Dand scale-invariant. Our map is monotone, thus providing a Newton form for...

Results on polynomial interpolation with mixed modular operations and unknown moduli

Motivated by a recently introduced HIMMO key predistribution scheme, we investigate the limits of various attacks on the polynomial interpolation problem with mixed modular operations and hidden moduli. We firstly review the classical attack and consider it in a quantum-setting. Then, we introduce new techniques for finding out the secret moduli and consider quantum speed-ups.

Lectures on Multivariate Polynomial Interpolation

Polynomial Interpolation

Consider a family of functions of a single variable x: Φ(x; a0, a1, . . . , an), where a0, . . . , an are the parameters. The problem of interpolation for Φ can be stated as follows: Given n + 1 real or complex pairs of numbers (xi, fi), i = 0, . . . , n, with xi 6= xk for i 6= k, determine a0, . . . , an such that Φ(xi; a0, . . . , an) = fi, i = 0, . . . , n. The above is a linear interpolatio...